33 research outputs found
Dominating Sets and Domination Polynomials of Cycles
Let G = (V,E) be a simple graph. A set S ⊆ V is a dominating set of G, if every vertex in V \S is adjacent to at least one vertex in S. Let Ci n be the family of dominating sets of a cycle Cn with cardinality i, and let d(Cn, i) = |Ci n|. In this paper, we construct Ci n,and obtain a recursive formula for d(Cn, i). Using this recursive formula, we consider the polynomial D(Cn, x) = Pn
i=⌈ n 3 ⌉ d(Cn, i)xi, which we call domination polynomial of cycles and obtain some properties of this polynomial
Chromatic equivalence classes of certain generalized polygon trees, III
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically equivalent, if P(G)=P(H). A set of graphs S is called a chromatic equivalence class if for any graph H that is chromatically equivalent with a graph G in S, then H∈S. Peng et al. (Discrete Math. 172 (1997) 103–114), studied the chromatic equivalence classes of certain generalized polygon trees. In this paper, we continue that study and present a solution to Problem 2 in Koh and Teo (Discrete Math. 172 (1997) 59–78)
Chromatically unique bipartite graphs with certain 3-independent partition numbers III
For integers p, q, s with p ≥ q ≥ 2 and s ≥ 0 , let ( ) 2 , K−s p q denote the set of 2_connected bipartite graphs which can be obtained from K(p,q) by deleting a set
of s edges. In this paper, we prove that for any graph ( ) 2 G∈K−s p,q with p ≥ q ≥ 3 and 1 ≤ s ≤ q - 1 if the number of 3-independent partitions of G is 2p-1 + 2q-1 + s +
4, then G is chromatically unique. This result extends both a theorem by Dong et al.[2]; and results in [4] and [5]
Chromatic equivalence class of the join of certain tripartite graphs
For a simple graph G, let P(G;λ) be the chromatic polynomial of G. Two graphs G and H are said to be chromatically equivalent, denoted G ~ H if P(G;λ) = P(H;λ). A graph G is said to be chromatically unique, if H ~ G implies that H ≅ G. Chia [4] determined the chromatic equivalence class of the graph consisting of the join of p copies of the path each of length 3. In this paper, we determined the chromatic equivalence class of the graph consisting of the join of p copies of the complete tripartite graph K1,2,3. MSC: 05C15;05C6
On the domination number of some graphs.
Let G = (V,E) be a simple graph. A set S ⊆ V is a dominating set of graph G, if every vertex in V − S is adjacent to at least one vertex in S. The domination number γ(G) is the minimum cardinality of a dominating set in G. It is well known that if e ∈ E(G), then γ(G−e)−1 ≤ γ(G) ≤ γ(G−e). In this paper, as an application of this inequality, we obtain the domination number of some certain graphs